A Construction for Infinite Families of Steiner 3-Designs
نویسندگان
چکیده
Let q be a prime power and a be a positive integer such that a 2. Assume that there is a Steiner 3-(a+1, q+1, 1) design. For every v satisfying certain arithmetic conditions we can construct a Steiner 3-(va+1, q+1, 1) design for every d sufficiently large. In the case of block size 6, when q=5, this theorem yields new infinite families of Steiner 3-designs: if v is a given positive integer satisfying the necessary arithmetic conditions, for every non-negative integer m there exists a Steiner 3-(v(4 } 5+1)+1), 6, 1) for sufficiently large d. 2001 Academic Press
منابع مشابه
An infinite family of Steiner systems S(2, 4, 2m) from cyclic codes
Steiner systems are a fascinating topic of combinatorics. The most studied Steiner systems are S(2,3,v) (Steiner triple systems), S(3,4,v) (Steiner quadruple systems), and S(2,4,v). There are a few infinite families of Steiner systems S(2,4,v) in the literature. The objective of this paper is to present an infinite family of Steiner systems S(2,4,2m) for all m ≡ 2 (mod 4)≥ 6 from cyclic codes. ...
متن کاملConstructions for generalized Steiner systems GS (3, 4, v , 2)
Generalized Steiner systems GS (3, 4, v, 2) were first discussed by Etzion and used to construct optimal constant weight codes over an alphabet of size three with minimum Hamming distance three, in which each codeword has length v and weight four. Not much is known for GS (3, 4, v, 2)s except for a recursive construction and two small designs for v = 8, 10 given by Etzion. In this paper, more s...
متن کاملNew infinite families of Candelabra Systems with block size 6 and stem size 2
In this paper, we seek to generalize a construction of Hanani which produces a Steiner 3design on a larger set of points starting from a smaller Steiner 3-design, with constant block size 6. We achieve this by constructing new infinite families of uniform Candelabra Systems with block size 6 and stem size 2.
متن کاملGraphs with the N-e.c. Adjacency Property Constructed from Resolvable Designs
Random graphs with high probability satisfy the n-e.c. adjacency property, although until recently few explicit examples of such graphs were known. We supply a new general construction for generating infinite familes of finite regular n-e.c. graphs derived from certain resolvable Steiner 2-designs. We supply an extension of our construction to the infinite case, and thereby give a new represent...
متن کاملNew infinite families of orthogonal designs constructed from complementary sequences
In this paper, we present new infinite families of three and four variable orthogonal designs based on several constructions derived from complementary sequences. The above method leads to the construction of many classes of orthogonal designs. In addition, we obtain new infinite families of weighing matrices constructed by complementary sequences, such as W (144 + 4s, 144) and W (224 + 4s, 196...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 94 شماره
صفحات -
تاریخ انتشار 2001